Some Geometric Aspects of Graphs and their Eigenfunctions
نویسنده
چکیده
We study three mathematical notions, that of nodal regions for eigenfunctions of the Laplacian, that of covering theory, and that of fiber products, in the context of graph theory and spectral theory for graphs. We formulate analogous notions and theorems for graphs and their eigenpairs. These techniques suggest new ways of studying problems related to spectral theory of graphs. We also perform some numerical experiments suggesting that the fiber product can yield graphs with small second eigenvalue.
منابع مشابه
On the total version of geometric-arithmetic index
The total version of geometric–arithmetic index of graphs is introduced based on the endvertex degrees of edges of their total graphs. In this paper, beside of computing the total GA index for some graphs, its some properties especially lower and upper bounds are obtained.
متن کاملBirkhoff's Theorem from a geometric perspective: A simple example
From Hilbert's theorem of zeroes, and from Noether's ideal theory, Birkhoff derived certain algebraic concepts (as explained by Tholen) that have a dual significance in general toposes, similar to their role in the original examples of algebraic geometry. I will describe a simple example that illustrates some of the aspects of this relationship. The dualization from algebra to geometr...
متن کاملSome topological indices of graphs and some inequalities
Let G be a graph. In this paper, we study the eccentric connectivity index, the new version of the second Zagreb index and the forth geometric–arithmetic index.. The basic properties of these novel graph descriptors and some inequalities for them are established.
متن کاملGeometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملGenerating an Indoor space routing graph using semantic-geometric method
The development of indoor Location-Based Services faces various challenges that one of which is the method of generating indoor routing graph. Due to the weaknesses of purely geometric methods for generating indoor routing graphs, a semantic-geometric method is proposed to cover the existing gaps in combining the semantic and geometric methods in this study. The proposed method uses the CityGML...
متن کامل